package dujiu.luogu.branch;

import java.util.Arrays;
import java.util.Scanner;

public class P1888 {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int a = scanner.nextInt();
        int b = scanner.nextInt();
        int c = scanner.nextInt();
        int[] arr = {a,b,c};
        Arrays.sort(arr);
        int gongYuShu = f(arr[0],arr[arr.length-1]);
        System.out.println(arr[0]/gongYuShu+"/"+arr[arr.length-1]/gongYuShu);
        scanner.close();
    }

    public static int f(int a ,int b){  //求公约数
        for (int i =a;i>=1;i-- ){
            if(a%i==0&&b%i==0){
                return i;
            }
        }
        return 1;
    }
}
